Hybrid Systems Verification with Isabelle/HOL: Simpler Syntax, Better Models, Faster Proofs

We extend a semantic verification framework for hybrid systems with the Isabelle/HOL proof assistant by an algebraic model program stores, shallow expression programs and their correctness specifications, domain-specific deductive calculational support. The new store yields clean separations dynamic local views of variables, e.g. discrete/continuous, mutable/immutable, program/logical, enhanced ways manipulating them using combinators, projections framing. This leads to more inference rules, procedures tactics reasoning invariant sets, certifying solutions specifications or calculating derivatives increased automation scalability. provides user-friendly syntax, better control name spaces interfaces connecting real-world modelling languages.